Skill Characterization Based on Betweenness
نویسندگان
چکیده
We present a characterization of a useful class of skills based on a graphical representation of an agent’s interaction with its environment. Our characterization uses betweenness, a measure of centrality on graphs. It captures and generalizes (at least intuitively) the bottleneck concept, which has inspired many of the existing skill-discovery algorithms. Our characterization may be used directly to form a set of skills suitable for a given task. More importantly, it serves as a useful guide for developing incremental skill-discovery algorithms that do not rely on knowing or representing the interaction graph in its entirety.
منابع مشابه
Further Results on Betweenness Centrality of Graphs
Betweenness centrality is a distance-based invariant of graphs. In this paper, we use lexicographic product to compute betweenness centrality of some important classes of graphs. Finally, we pose some open problems related to this topic.
متن کاملCharacterization of weighted complex networks.
To account for possible distinct functional roles played by different nodes and links in complex networks, we introduce and analyze a class of weighted scale-free networks. The weight of a node is assigned as a random number, based on which the weights of links are defined. We utilize the concept of betweenness to characterize the weighted networks and obtain the scaling laws governing the betw...
متن کاملBetweenness-Based Method to Identify Critical Transmission Sectors for Supply Chain Environmental Pressure Mitigation.
To develop industry-specific policies for mitigating environmental pressures, previous studies primarily focus on identifying sectors that directly generate large amounts of environmental pressures (a.k.a. production-based method) or indirectly drive large amounts of environmental pressures through supply chains (e.g., consumption-based method). In addition to those sectors as important environ...
متن کاملTowards a characterization of graphs with distinct betweenness centralities
In a social network individuals have prominent centrality if they are intermediaries between the communication of others. The betweenness centrality of a vertex measures the number of intersecting geodesics between two other vertices. Formally, the betweenness centrality of a vertex v is the ratio of the number of shortest paths between two other vertices u and w which contain v to the total nu...
متن کاملSparse Networks-Based Speedup Technique for Proteins Betweenness Centrality Computation
The study of proteomics reached unexpected levels of interest, as a direct consequence of its discovered influence over some complex biological phenomena, such as problematic diseases like cancer. This paper presents the latest authors’ achievements regarding the analysis of the networks of proteins (interactome networks), by computing more efficiently the betweenness centrality measure. The pa...
متن کامل